Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
نویسنده
چکیده
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and nondeterminism interact, a situation common to probabilistic distributed algorithms. We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of components. We illustrate the methods with an analysis of performance of the probabilistic dining philosophers [10].
منابع مشابه
Quantitative Program Logic and Eeciency in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic 13] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and nondeterminism interact, a situation common to probabilistic distributed algorithms. We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of compone...
متن کاملVerifying Randomized Distributed Algorithms with PRISM?
In this paper we describe our experience with model checking randomized distributed algorithms using PRISM, a symbolic model checker for concurrent probabilistic systems currently being developed. PRISM uses Multi-Terminal Binary Decision Diagrams (MTBDDs) as supplied by the CUDD package of Fabio Somenzi. Implemented in Java, PRISM has a system description language similar to Reactive Modules a...
متن کاملA Design Methodology for Reliable MRF-Based Logic Gates
Probabilistic-based methods have been used for designing noise tolerant circuits recently. In these methods, however, there is not any reliability mechanism that is essential for nanometer digital VLSI circuits. In this paper, we propose a novel method for designing reliable probabilistic-based logic gates. The advantage of the proposed method in comparison with previous probabilistic-based met...
متن کاملAdvances in Probabilistic Model Checking
Probabilistic model checking is an automated verification method that aims to establish the correctness of probabilistic systems. Probability may arise, for example, due to failures of unreliable components, communication across lossy media, or through the use of randomisation in distributed protocols. Probabilistic model checking enables a range of exhaustive, quantitative analyses of properti...
متن کاملپخش بار احتمالاتی با استفاده از تبدیل بی بوی کروی
Today's with the increasing development of distributed energy resources, power system analysis has been entered a new level of attention. Since the majority of these types of energy resources are affected by environmental conditions, the uncertainty in the power system has been expanded; so probabilistic analysis has become more important. Among the various methods of probabilistic analysis, po...
متن کامل